منابع مشابه
A Polygraphic Survey on Finiteness Conditions for Rewriting Systems
In 1987, Craig Squier proved that, if a monoid can be presented by a finite convergent string rewriting system, then it satisfies the homological finiteness condition left-FP3. Using this result, he has constructed finitely presented decidable monoids that cannot be presented by finite convergent rewriting systems. In 1994, Squier introduced the condition of finite derivation type, which is a h...
متن کاملFiniteness Conditions for Strictness Analysis
We give upper bounds on the number of times the fixed point operator needs to be unfolded for strictness analysis of functional languages with lists. This extends previous work both in the syntax-directed nature of the approach and in the ability to deal with Wadler’s method for analysing lists. Limitations of the method are indicated.
متن کاملOn Homotopical and Homological Finiteness Conditions for Finitely Presented Monoids
An example of a nitely presented monoid is given that does not satisfy the homo-topical niteness condition FHT, although it satisses both the homological niteness conditions left FP 1 and right FP 1 .tions left FP 1 and right FP 1 .
متن کاملFiniteness Conditions for Light-Front Hamiltonians
Many advantages of the light-front (LF) formulation for bound state problems arise from the manifest boost invariance in the longitudinal direction [1{5]. The price for this advantage is that other symmetries, such as parity or rotational invariance (for rotations around a transverse axis) are no longer manifest [6,7]. From the technical point of view, the loss of manifest parity and full rotat...
متن کاملFiniteness conditions on the Yoneda algebra of a monomial algebra
Let A be a connected graded noncommutative monomial algebra. We associate to A a finite graphΓ (A) called the CPS graph of A. Finiteness properties of the Yoneda algebra ExtA(k, k) including Noetherianity, finite GK dimension, and finite generation are characterized in terms of Γ (A). We show that these properties, notably finite generation, can be checked by means of a terminating algorithm. ©...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1951
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1951-0043139-4